Solving resource constrained shortest path problems with LP-based methods
نویسندگان
چکیده
منابع مشابه
Solving resource constrained shortest path problems with LP-based methods
In the resource constrained shortest path problem (RCSPP) there is a directed graph along with a source node and a destination node, and each arc has a cost and a vector of weights specifying its requirements from a set of resource types with finite capacities. A minimum cost source-destination directed path is sought such that the total consumption of the arcs from each resource type does not ...
متن کاملSolving resource constrained shortest path problems with Branch-and-Cut
In the resource constrained shortest path problem (RCSPP) a shortest path satisfying additional resource bounds is sought. Each arc has a length and a resource usage vector specifying the requirements from each resource of a finite set of resources. The resource bounds limit the total usage along feasible paths for each resource type. In this paper we introduce new cutting planes, separation pr...
متن کاملLP problems constrained with D-FRIs
In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated where the feasible region is formed as the intersection of two inequality fuzzy systems and Dombi family of t-norms is considered as fuzzy composition. Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of ...
متن کاملLagrangian relaxation and enumeration for solving constrained shortest-path problems
The constrained shortest-path problem (CSPP) generalizes the standard shortest-path problem by adding one or more path-weight side constraints. We present a new algorithm for CSPP that Lagrangianizes those constraints, optimizes the resulting Lagrangian function, identifies a feasible solution, and then closes any optimality gap by enumerating nearshortest paths, measured with respect to the La...
متن کاملSolving Stochastic Shortest-Path Problems with RTDP
We present a modification of the Real-Time Dynamic Programming (rtdp) algorithm that makes it a genuine off-line algorithm for solving Stochastic Shortest-Path problems. Also, a new domainindependent and admissible heuristic is presented for Stochastic Shortest-Path problems. The new algorithm and heuristic are compared with Value Iteration over benchmark problems with large state spaces. The r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2016
ISSN: 0305-0548
DOI: 10.1016/j.cor.2016.04.013